Low Density Parity Check Codes: Bandwidth Efficient Channel Coding

نویسندگان

  • Wai Fong
  • Shu Lin
  • Gary Maki
  • Pen-Shu Yeh
چکیده

Abstruct-Low Density Parity Check (LDPC) Codes provide near-Shannon Capacity performance for NASA Missions. These codes have high coding rates R=0.82 and 0.875 with moderate code lengths, n=4096 and 8176. Their decoders have inherently parallel structures which allows for high-speed implementation. Two codes based on Euclidean Geometry (EG) were selected for flight ASIC implementation. These codes are cyclic and quasi-cyclic in nature and therefore have a simple encoder structure. This results in power and size benefits. These codes also have a large minimum distance as much as d,,, = 65 giving them powerful error correcting capabilities and error floors less than lo-’’ BER. This paper will present development of the LDPC flight encoder and decoder, its applications and status.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes

This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...

متن کامل

Ber Evaluation of Ldpc Codes with Gmsk in Nakagami Fading Channel

LDPC codes (Low Density Parity Check Codes) have already proved its efficacy while showing its performance near to the Shannon limit. Channel coding schemes are spectrally inefficient as using an unfiltered binary data stream to modulate an RF carrier that will produce an RF spectrum of considerable bandwidth. Techniques have been developed to improve this bandwidth inefficiency or spectral eff...

متن کامل

On the Practicality of Low-Density Parity-Check Codes

Recent advances in coding theory have produced two classes of codes, turbo codes and low-density parity-check (LDPC) codes, which approach the Shannon limit of channel capacity while admitting efficient implementations of message encoding and decoding in software. Theoretic results about the latter have been shown to apply to the former, hence we examine the evolution of LDPC codes from their o...

متن کامل

LDPC codes from Singer cycles

The main goal of coding theory is to devise efficient systems to exploit the full capacity of a communication channel, thus achieving an arbitrarily small error probability. Low Density Parity Check (LDPC) codes are a family of block codes—characterised by admitting a sparse parity check matrix—with good correction capabilities. In the present paper the orbits of subspaces of a finite projectiv...

متن کامل

White Paper for Low Density Parity Check ( LDPC ) Codes for CCSDS Channel

Background: The current CCSDS documents Telemetry Channel Coding Blue Book 101.0-B-5, TC Synchronization and Channel Coding 131.0-R-1, and TM Synchronization and Channel Coding 231.0-R-1 define three FEC channel coding methods: Convolutional Codes (CC), Reed Solomon (RS) Codes, and Turbo Codes (TC). CC are bandwidth inefficient although puncturing options are available that mitigate this. This ...

متن کامل

Combined Source-Channel Coding of Images under Power and Bandwidth Constraints

This paper proposes a framework for combined source-channel coding for a power and bandwidth constrained noisy channel. The framework is applied to progressive image transmission using constant envelope M-ary phase shift key (M-PSK) signaling over an additive white Gaussian noise channel. First, the framework is developed for uncoded M-PSK signaling (with M = 2k). Then, it is extended to includ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003